github.com/andybalholm/brotli.hashLongestMatchQuickly.bucketBits (field)
8 uses
github.com/andybalholm/brotli (current package)
hash.go#L236: bucketBits: 16,
hash.go#L243: bucketBits: 16,
hash.go#L250: bucketBits: 17,
hash.go#L289: bucketBits: 20,
hash_longest_match_quickly.go#L31: return uint32(hash >> (64 - h.bucketBits))
hash_longest_match_quickly.go#L42: bucketBits uint
hash_longest_match_quickly.go#L51: h.buckets = make([]uint32, 1<<h.bucketBits+h.bucketSweep)
hash_longest_match_quickly.go#L55: var partial_prepare_threshold uint = (4 << h.bucketBits) >> 7
![]() |
The pages are generated with Golds v0.8.4. (GOOS=linux GOARCH=amd64) Golds is a Go 101 project developed by Tapir Liu. PR and bug reports are welcome and can be submitted to the issue list. Please follow @zigo_101 (reachable from the left QR code) to get the latest news of Golds. |